Extension Variables in QBF Resolution

نویسندگان

  • Olaf Beyersdorff
  • Leroy Chew
  • Mikolás Janota
چکیده

We investigate two QBF resolution systems that use extension variables: weak extended Q-resolution, where the extension variables are quantified at the innermost level, and extended Q-resolution, where the extension variables can be placed inside the quantifier prefix. These systems have been considered previously by (Jussila et al. 2007), who give experimental evidence that extended Q-resolution is stronger than weak extended Q-resolution. Here we prove an exponential separation between the two systems, thereby confirming the conjecture of (Jussila et al. 2007). Conceptually, this separation relies on showing strategy extraction for weak extended Q-resolution by boundeddepth circuits. In contrast, we show that this strong strategy extraction result fails in extended Q-resolution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mikoláš Janota

Over the years, proof systems for propositional satisfiability (SAT) have been extensively studied. Recently, proof systems for quantified Boolean formulas (QBFs) have also been gaining attention. Q-resolution is a calculus enabling producing proofs from DPLL-based QBF solvers. While DPLL has become a dominating technique for SAT, QBF has been tackled by other complementary and competitive appr...

متن کامل

On Propositional QBF Expansions and Q-Resolution

Over the years, proof systems for propositional satisfiability (SAT) have been extensively studied. Recently, proof systems for quantified Boolean formulas (QBFs) have also been gaining attention. Q-resolution is a calculus enabling producing proofs from DPLL-based QBF solvers. While DPLL has become a dominating technique for SAT, QBF has been tackled by other complementary and competitive appr...

متن کامل

Resolution-Based Certificate Extraction for QBF - (Tool Presentation)

A certificate of (un)satisfiability for a quantified Boolean formula (QBF) represents concrete assignments to the variables, which act as witnesses for its truth value. Certificates are highly requested for practical applications of QBF like formal verification and model checking. We present an integrated set of tools realizing resolution-based certificate extraction for QBF in prenex conjuncti...

متن کامل

Formulas with Large Weight: a New Technique for Genuine QBF Lower Bounds

We devise a new technique to prove lower bounds for the proof size in resolutiontype calculi for quantified Boolean formulas (QBF). The new technique applies to the strong expansion system IR-calc and thereby also to the most studied QBF system Q-Resolution. Our technique exploits a clear semantic paradigm, showing the hardness of a QBF family by demonstrating that (1) the formulas require larg...

متن کامل

Extracting and Checking Q-Resolution Proofs from a State-Of-The-Art QBF-Solver

The logic of Quantified Boolean Formulas (QBF) is an extension of propositional logic and provides compact encodings of real world problems in various fields of application, e.g., formal verification, reasoning and artificial intelligence. In recent years, the development of efficient decision procedures for QBF has progressed considerably. However, most current state-of-the-art QBF-solvers ret...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2016